package com.atguigu.binaryTree;

public class FoldProblem {
    public static void printAllFolds(int n){
        printProcess(1,n,true);
    }
    //递归过程,来到了某一个节点
    //i是节点的层数  down==true 凹   down==false 凸
    public static void printProcess(int i,int n,boolean down){
        if(i>n){
            return;
        }
        printProcess(i+1,n,true);
        System.out.println(down?"凹":"凸");
        printProcess(i+1,n,false);
    }
}
